Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
نویسندگان
چکیده
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed Automata (PTA). We show how PTAs can be elegantly modeled via logic programming extended with coinduction and constraints over reals. We use this logic programming realization of a PTA to develop an elegant solution to the generalized railroad crossing problem of Lynch and Heitmeyer. Interesting properties of the system can be verified merely by posing appropriate queries to this coinductive constraint logic program.
منابع مشابه
Modeling Systems in CLP with Coinductive Tabling
We present a methodology for the modelling of complex program behavior in CLP. The first part of this paper is an informal description about how to represent a system in CLP. At its basic level, this representation captures the precise trace semantics of concurrent programs, or even high-level specifications, in the form of a predicate transformer. Based on traces, the method can also capture p...
متن کاملModeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its basic level, this representation captures the trace semantics of concurrent programs, or even high-level specifications, in the form of a predicate transformer. Based on traces, the method can also capture properties of...
متن کاملReasoning about Durations inMetric Temporal
A formal framework for specifying and verifying real-time systems with a continuous environment is presented. Metric Temporal Logic (MTL) is extended with a duration concept similar to the one in the Duration Calculus (DC). The resulting logic, called MTL-R , is compared with DC and is shown to be more expressive. Axioms for MTL-R and a sound rule to prove that a timed transition system satisse...
متن کاملFrom Coinductive Proofs to Exact Real Arithmetic
We give a coinductive characterization of the set of continuous functions defined on a compact real interval, and extract certified programs that construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded...
متن کاملEffectiveness of Optimizing Compilation for CLP(R)
Constraint Logic Programming (CLP) languages extend logic programming by allowing constraints from diierent domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive mathematical modelling and complex combinatorial optimization problems. However, CLP languages have mainly been considered as research systems, useful for rapid...
متن کامل